a lagrangean relaxation- genetic algorithm heuristic for multi-product multi-stage and multi-period lot sizing problem with limited resource capacity
نویسندگان
چکیده
in this paper, a hybrid method for limited resource allocation and leveling in complex multi-stage, multi-product and multi-period production planning problems with aim of lot-size determination and total cost minimization has been proposed. this problem consists of multiple products with sequential production processes that are produced in different periods to meet the customers demand. by determining decision variables, production capacity of machines and customers demand, an integer linear program is developed to minimize the total set-up, inventory holding and production cost. a three-stage approach has been developed to solve the problem. in the first stage, the primary problem is divided into several sub-problems using a heuristic algorithm based on the limited resource lagrangean multipliers. in this case, each sub-problem could be solved using more simple methods. in the second stage a new approach is proposed to solve these sub-problems combining the genetic algorithm with a neighborhood search technique. in the third stage resource leveling is performed among sub-problems to obtain a better solution. in this case, lot-size for each product is determined during the planning periods. this paper's objectives have been evaluated and verified through several empirical experiments.
منابع مشابه
Combination of Genetic Algorithm With Lagrange Multipliers For Lot-Size Determination in Capacity Constrained Multi-Period, Multi-Product and Multi-Stage Problems
Abstract : In this paper a meta-heuristic approach has been presented to solve lot-size determination problems in a complex multi-stage production planning problems with production capacity constraint. This type of problems has multiple products with sequential production processes which are manufactured in different periods to meet customer’s demand. By determining the decision variables, mac...
متن کاملLagrangean Heuristic for a Multi-Plant Lot-Sizing Problem with Transfer and Storage Capacities
The paper addresses a multi-item, multi-plant lot-sizing problem with transfer costs and capacity constraints. The problem is reformulated according to a multi-commodity flow formalism, and decomposed, through Lagrangean relaxation, into a master facility location problem and a slave minimal cost multi-commodity flow problem. The decomposition framework gives rise in a natural way to the design...
متن کاملGenetic Algorithm Approach for Analysis of Multi Item Multi Period Procurement Lot Sizing Problem
This paper approaches Genetic algorithm for multi objective optimization of the multi item multi period procurement lot sizing problem. A mathematical model is developed to simulate raw material procurement lot sizing analysis for a real time valve manufacturing company. Model takes into account the constraints imposed by the budget, maximum order quantity and limited warehouse space. The analy...
متن کاملBuilding a Multi-Objective Model for Multi-Product Multi-Period Production Planning with Controllable Processing Times: A Real Case Problem
Model building is a fragile and complex process especially in the context of real cases. Each real case problem has its own characteristics with new concepts and conditions. A correct model should have some essential characteristics such as: being compatible with real conditions, being of sufficient accuracy, being logically traceable and etc. This paper discusses how to build an efficient mode...
متن کاملReliable multi-product multi-vehicle multi-type link logistics network design: A hybrid heuristic algorithm
This paper considers the reliable multi-product multi-vehicle multi-type link logistics network design problem (RMLNDP) with system disruptions, which is concerned with facilities locating, transshipment links constructing, and also allocating them to the customers in order to satisfy their demand on minimum expected total cost (including locating costs, link constructing costs, and also expect...
متن کاملSolving a multi-level capacitated lot sizing problem with multi-period setup carry-over via a fix-and-optimize heuristic
This paper presents a new algorithm for the dynamic Multi-Level Capacitated Lot Sizing Problem with Setup Carry-Overs (MLCLSP-L). The MLCLSP-L is a big-bucket model that allows the production of any number of products within a period, but it incorporates partial sequencing of the production orders in the sense that the first and the last product produced in a period are determined by the model....
متن کاملمنابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
مهندسی صنایعجلد ۴۴، شماره ۱، صفحات ۰-۰
کلمات کلیدی
میزبانی شده توسط پلتفرم ابری doprax.com
copyright © 2015-2023